A Novel Hashing Method Suitable for Lookup Functions

The paper describes a novel hashing method suitable for lookup functions. Traditional methods are either of lower hash quality or inferior performance. In this paper, we show how to compute a high-quality hash digest at extremely high performance on Intel ® processors using the crc32 instruction. Our method also generates multiple 32-bit hashes of an input data buffer, which have low correlation. This paper describes a novel hashing method suitable for lookup functions, based on the crc32 instruction. We show how to compute a high-quality 64-bit hash digest at extremely high performance on Intel ® processors. For large data buffers, the performance of our hash function tends to ~ 0.44 cycles/byte on a single thread of an Intel ® Core™ i5 650 processor. Even for small buffers (~24 bytes), the performance is better than 1 cycle/byte. The Intel ® Embedded Design Center provides qualified developers with web-based access to technical resources. Access Intel Confidential design materials, step-by step guidance, application reference solutions, training, Intel's tool loaner program, and connect with an e-help desk and the embedded community. Design Fast. Design Smart. Get started today. Overview This paper describes a novel hashing method suitable for lookup functions. Traditional methods are either of lower hash quality or inferior performance. In this paper, we show how to compute a high-quality hash digest at extremely high performance on Intel ® processors using the crc32 instruction [3]. Our method also generates multiple 32-bit hashes of an input data buffer, which have low correlation and is useful in contexts such as network processing applications.